package Review.MapAndSet;

// key-value 模型
public class HashBuck {
    private static class Node {
        private int key;
        private int value;
        Node next;


        public Node(int key, int value) {
            this.key = key;
            this.value = value;
        }
    }


    private Node[]  array;
    private int size;   // 当前的数据个数
    private static final double LOAD_FACTOR = 0.75;
    private static final int DEFAULT_SIZE = 8;//默认桶的大小

    public int put(int key, int value) {
        // write code here
        int index = key%array.length;
        Node cur = array[index];
        while (cur !=null){
            if (cur.key==key){
                cur.value = value;
                return 0;
            }
            cur = cur.next;
        }
        //没有找到当前链表中有这个key的节点
        Node node = new Node(key,value);
        node.next = array[index];
        array[index] = node;
        size++;
        if (loadFactor()>=LOAD_FACTOR){
            resize();
        }
        return -1;
    }


    private void resize() {
        // write code here
        Node[] newArray = new Node[2*array.length];
        for (int i = 0; i < array.length; i++) {
            Node cur = array[i];
            while (cur !=null){
               int newIndex = cur.key%newArray.length;
               Node curN = cur.next;
               cur.next= newArray[newIndex];
               newArray[newIndex] = cur;
               cur =curN;
            }
        }
    }


    private double loadFactor() {
        return size * 1.0 / array.length;
    }

    public int get(int key) {
        int index = key%array.length;
        Node cur = array[index];
        while (cur !=null){
            if (cur.key==key){
                return cur.value;
            }
            cur = cur.next;
        }
        // write code here
        return 0;
    }
}
